<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>nih: bintree/bintree_gen_inline.h Source File</title>

<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>

</head>
<body>
<div id="top"><!-- do not remove this div! -->


<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  
  
  <td style="padding-left: 0.5em;">
   <div id="projectname">nih
   &#160;<span id="projectnumber">0.5</span>
   </div>
   
  </td>
  
  
  
 </tr>
 </tbody>
</table>
</div>

<!-- Generated by Doxygen 1.7.5.1 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="modules.html"><span>Modules</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
    </ul>
  </div>
</div>
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
  initNavTree('bintree__gen__inline_8h.html','');
</script>
<div id="doc-content">
<div class="header">
  <div class="headertitle">
<div class="title">bintree/bintree_gen_inline.h</div>  </div>
</div>
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
<a name="l00002"></a>00002 <span class="comment"> * Copyright (c) 2010-2011, NVIDIA Corporation</span>
<a name="l00003"></a>00003 <span class="comment"> * All rights reserved.</span>
<a name="l00004"></a>00004 <span class="comment"> *</span>
<a name="l00005"></a>00005 <span class="comment"> * Redistribution and use in source and binary forms, with or without</span>
<a name="l00006"></a>00006 <span class="comment"> * modification, are permitted provided that the following conditions are met:</span>
<a name="l00007"></a>00007 <span class="comment"> *   * Redistributions of source code must retain the above copyright</span>
<a name="l00008"></a>00008 <span class="comment"> *     notice, this list of conditions and the following disclaimer.</span>
<a name="l00009"></a>00009 <span class="comment"> *   * Redistributions in binary form must reproduce the above copyright</span>
<a name="l00010"></a>00010 <span class="comment"> *     notice, this list of conditions and the following disclaimer in the</span>
<a name="l00011"></a>00011 <span class="comment"> *     documentation and/or other materials provided with the distribution.</span>
<a name="l00012"></a>00012 <span class="comment"> *   * Neither the name of NVIDIA Corporation nor the</span>
<a name="l00013"></a>00013 <span class="comment"> *     names of its contributors may be used to endorse or promote products</span>
<a name="l00014"></a>00014 <span class="comment"> *     derived from this software without specific prior written permission.</span>
<a name="l00015"></a>00015 <span class="comment"> *</span>
<a name="l00016"></a>00016 <span class="comment"> * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS &quot;AS IS&quot; AND</span>
<a name="l00017"></a>00017 <span class="comment"> * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED</span>
<a name="l00018"></a>00018 <span class="comment"> * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE</span>
<a name="l00019"></a>00019 <span class="comment"> * DISCLAIMED. IN NO EVENT SHALL &lt;COPYRIGHT HOLDER&gt; BE LIABLE FOR ANY</span>
<a name="l00020"></a>00020 <span class="comment"> * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES</span>
<a name="l00021"></a>00021 <span class="comment"> * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;</span>
<a name="l00022"></a>00022 <span class="comment"> * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND</span>
<a name="l00023"></a>00023 <span class="comment"> * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT</span>
<a name="l00024"></a>00024 <span class="comment"> * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS</span>
<a name="l00025"></a>00025 <span class="comment"> * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</span>
<a name="l00026"></a>00026 <span class="comment"> */</span>
<a name="l00027"></a>00027 
<a name="l00028"></a>00028 <span class="preprocessor">#include &lt;<a class="code" href="functors_8h.html" title="Defines some general purpose functors.">nih/basic/functors.h</a>&gt;</span>
<a name="l00029"></a>00029 <span class="preprocessor">#include &lt;<a class="code" href="algorithms_8h.html" title="Defines some general purpose algorithms.">nih/basic/algorithms.h</a>&gt;</span>
<a name="l00030"></a>00030 <span class="preprocessor">#include &lt;nih/basic/utils.h&gt;</span>
<a name="l00031"></a>00031 <span class="preprocessor">#include &lt;stack&gt;</span>
<a name="l00032"></a>00032 
<a name="l00033"></a>00033 <span class="keyword">namespace </span>nih {
<a name="l00034"></a>00034 <span class="keyword">namespace </span>bintree {
<a name="l00035"></a>00035 
<a name="l00036"></a><a class="code" href="structnih_1_1bintree_1_1_split__task.html">00036</a>     <span class="keyword">struct </span><a class="code" href="structnih_1_1bintree_1_1_split__task.html">Split_task</a>
<a name="l00037"></a>00037     {
<a name="l00038"></a>00038         NIH_HOST_DEVICE <a class="code" href="structnih_1_1bintree_1_1_split__task.html">Split_task</a>() {}
<a name="l00039"></a>00039         NIH_HOST_DEVICE <a class="code" href="structnih_1_1bintree_1_1_split__task.html">Split_task</a>(<span class="keyword">const</span> uint32 <span class="keywordtype">id</span>, <span class="keyword">const</span> uint32 begin, <span class="keyword">const</span> uint32 end, <span class="keyword">const</span> uint32 in = 0)
<a name="l00040"></a>00040             : m_node( <span class="keywordtype">id</span> ), m_begin( begin ), m_end( end ), m_input( in ) {}
<a name="l00041"></a>00041 
<a name="l00042"></a>00042         uint32 m_node;
<a name="l00043"></a>00043         uint32 m_begin;
<a name="l00044"></a>00044         uint32 m_end;
<a name="l00045"></a>00045         uint32 m_input;
<a name="l00046"></a>00046     };
<a name="l00047"></a>00047 
<a name="l00048"></a>00048     <span class="comment">// find the most significant bit smaller than start by which code0 and code1 differ</span>
<a name="l00049"></a>00049     <span class="keyword">template</span> &lt;<span class="keyword">typename</span> Integer&gt;
<a name="l00050"></a>00050     FORCE_INLINE NIH_HOST_DEVICE int32 find_leading_bit_difference(
<a name="l00051"></a>00051         <span class="keyword">const</span>  int32  start_level,
<a name="l00052"></a>00052         <span class="keyword">const</span> Integer code0,
<a name="l00053"></a>00053         <span class="keyword">const</span> Integer code1)
<a name="l00054"></a>00054     {
<a name="l00055"></a>00055         int32 level = start_level;
<a name="l00056"></a>00056 
<a name="l00057"></a>00057         <span class="keywordflow">while</span> (level &gt;= 0)
<a name="l00058"></a>00058         {
<a name="l00059"></a>00059             <span class="keyword">const</span> Integer mask = Integer(1u) &lt;&lt; level;
<a name="l00060"></a>00060 
<a name="l00061"></a>00061             <span class="keywordflow">if</span> ((code0 &amp; mask) !=
<a name="l00062"></a>00062                 (code1 &amp; mask))
<a name="l00063"></a>00063                 <span class="keywordflow">break</span>;
<a name="l00064"></a>00064 
<a name="l00065"></a>00065             --level;
<a name="l00066"></a>00066         }
<a name="l00067"></a>00067         <span class="keywordflow">return</span> level;
<a name="l00068"></a>00068     }
<a name="l00069"></a>00069 
<a name="l00070"></a>00070 } <span class="comment">// namespace bintree</span>
<a name="l00071"></a>00071 
<a name="l00072"></a>00072 <span class="keyword">template</span> &lt;<span class="keyword">typename</span> Tree, <span class="keyword">typename</span> Integer&gt;
<a name="l00073"></a>00073 <span class="keywordtype">void</span> <a class="code" href="group__bintree.html#gad76a50ae08ab4d525f748a7cbcc0fb6e">generate</a>(
<a name="l00074"></a>00074     <span class="keyword">const</span> uint32   n_codes,
<a name="l00075"></a>00075     <span class="keyword">const</span> Integer* codes,
<a name="l00076"></a>00076     <span class="keyword">const</span> uint32   bits,
<a name="l00077"></a>00077     <span class="keyword">const</span> uint32   max_leaf_size,
<a name="l00078"></a>00078     <span class="keyword">const</span> <span class="keywordtype">bool</span>     keep_singletons,
<a name="l00079"></a>00079     Tree&amp;          tree)
<a name="l00080"></a>00080 {
<a name="l00081"></a>00081     <span class="keyword">typedef</span> bintree::Split_task Split_task;
<a name="l00082"></a>00082 
<a name="l00083"></a>00083     tree.reserve_nodes( n_codes * 2 );
<a name="l00084"></a>00084     tree.reserve_leaves( n_codes );
<a name="l00085"></a>00085 
<a name="l00086"></a>00086     std::vector&lt;Split_task&gt; task_queues[2];
<a name="l00087"></a>00087     std::vector&lt;uint32&gt;     skip_queues[2];
<a name="l00088"></a>00088 
<a name="l00089"></a>00089     task_queues[0].push_back( Split_task(0,0,n_codes,bits-1) );
<a name="l00090"></a>00090     skip_queues[0].push_back(  uint32(-1) );
<a name="l00091"></a>00091 
<a name="l00092"></a>00092     uint32 node_count = 1;
<a name="l00093"></a>00093     uint32 leaf_count = 0;
<a name="l00094"></a>00094 
<a name="l00095"></a>00095     <span class="keyword">typename</span> Tree::Context context = tree.get_context();
<a name="l00096"></a>00096 
<a name="l00097"></a>00097     uint32 in_queue  = 0;
<a name="l00098"></a>00098     uint32 out_queue = 1;
<a name="l00099"></a>00099 
<a name="l00100"></a>00100     <span class="keywordflow">while</span> (task_queues[ in_queue ].size())
<a name="l00101"></a>00101     {
<a name="l00102"></a>00102         task_queues[ out_queue ].erase(
<a name="l00103"></a>00103             task_queues[ out_queue ].begin(),
<a name="l00104"></a>00104             task_queues[ out_queue ].end() );
<a name="l00105"></a>00105             
<a name="l00106"></a>00106         <span class="keywordflow">for</span> (uint32 task_id = 0; task_id &lt; task_queues[ in_queue ].size(); ++task_id)
<a name="l00107"></a>00107         {
<a name="l00108"></a>00108             <span class="keyword">const</span> Split_task task  = task_queues[ in_queue ][ task_id ];
<a name="l00109"></a>00109             <span class="keyword">const</span> uint32 skip_node = skip_queues[ in_queue ][ task_id ];
<a name="l00110"></a>00110 
<a name="l00111"></a>00111             <span class="keyword">const</span> uint32 node  = task.m_node;
<a name="l00112"></a>00112             <span class="keyword">const</span> uint32 begin = task.m_begin;
<a name="l00113"></a>00113             <span class="keyword">const</span> uint32 end   = task.m_end;
<a name="l00114"></a>00114                   uint32 level = task.m_input;
<a name="l00115"></a>00115 
<a name="l00116"></a>00116             <span class="keywordflow">if</span> (!keep_singletons)
<a name="l00117"></a>00117             {
<a name="l00118"></a>00118                 level = bintree::find_leading_bit_difference(
<a name="l00119"></a>00119                     level,
<a name="l00120"></a>00120                     codes[ begin ],
<a name="l00121"></a>00121                     codes[ end-1 ] );
<a name="l00122"></a>00122             }
<a name="l00123"></a>00123 
<a name="l00124"></a>00124             uint32 output_count = 0;
<a name="l00125"></a>00125             uint32 split_index;
<a name="l00126"></a>00126 
<a name="l00127"></a>00127             <span class="comment">// check whether the input node really needs to be split</span>
<a name="l00128"></a>00128             <span class="keywordflow">if</span> (end - begin &gt; max_leaf_size &amp;&amp; level != uint32(-1))
<a name="l00129"></a>00129             {
<a name="l00130"></a>00130                 <span class="comment">// find the &quot;partitioning pivot&quot; using a binary search</span>
<a name="l00131"></a>00131                 split_index = find_pivot(
<a name="l00132"></a>00132                     codes + begin,
<a name="l00133"></a>00133                     end - begin,
<a name="l00134"></a>00134                     mask_and&lt;Integer&gt;( Integer(1u) &lt;&lt; level ) ) - codes;
<a name="l00135"></a>00135 
<a name="l00136"></a>00136                 output_count = (split_index == begin || split_index == end) ? 1u : 2u;
<a name="l00137"></a>00137             }
<a name="l00138"></a>00138 
<a name="l00139"></a>00139             <span class="keyword">const</span> uint32 node_offset = node_count;
<a name="l00140"></a>00140             <span class="keyword">const</span> uint32 first_end   = (output_count == 1) ? end       : split_index;
<a name="l00141"></a>00141             <span class="keyword">const</span> uint32 first_skip  = (output_count == 1) ? skip_node : node_offset+1;
<a name="l00142"></a>00142 
<a name="l00143"></a>00143             <span class="keywordflow">if</span> (output_count &gt;= 1) { task_queues[ out_queue ].push_back( Split_task( node_offset+0, begin, first_end, level-1 ) ); skip_queues[ out_queue ].push_back( first_skip ); }
<a name="l00144"></a>00144             <span class="keywordflow">if</span> (output_count == 2) { task_queues[ out_queue ].push_back( Split_task( node_offset+1, split_index, end, level-1 ) ); skip_queues[ out_queue ].push_back( skip_node ); }
<a name="l00145"></a>00145 
<a name="l00146"></a>00146             <span class="keyword">const</span> <span class="keywordtype">bool</span> generate_leaf = output_count == 0;
<a name="l00147"></a>00147 
<a name="l00148"></a>00148             <span class="comment">// count how many leaves we need to generate</span>
<a name="l00149"></a>00149             <span class="keyword">const</span> uint32 leaf_index = leaf_count;
<a name="l00150"></a>00150 
<a name="l00151"></a>00151             node_count += output_count;
<a name="l00152"></a>00152             leaf_count += generate_leaf ? 1 : 0;
<a name="l00153"></a>00153 
<a name="l00154"></a>00154             <span class="comment">// write the parent node</span>
<a name="l00155"></a>00155             context.write_node(
<a name="l00156"></a>00156                 node,
<a name="l00157"></a>00157                 output_count ? split_index != begin : <span class="keyword">false</span>,
<a name="l00158"></a>00158                 output_count ? split_index != end   : <span class="keyword">false</span>,
<a name="l00159"></a>00159                 output_count ? node_offset          : leaf_index,
<a name="l00160"></a>00160                 skip_node,
<a name="l00161"></a>00161                 level,
<a name="l00162"></a>00162                 begin,
<a name="l00163"></a>00163                 end,
<a name="l00164"></a>00164                 output_count ? split_index : uint32(-1) );
<a name="l00165"></a>00165 
<a name="l00166"></a>00166             <span class="comment">// make a leaf if necessary</span>
<a name="l00167"></a>00167             <span class="keywordflow">if</span> (generate_leaf)
<a name="l00168"></a>00168                 context.write_leaf( leaf_index, begin, end );
<a name="l00169"></a>00169         }
<a name="l00170"></a>00170 
<a name="l00171"></a>00171         std::swap( in_queue, out_queue );
<a name="l00172"></a>00172     }
<a name="l00173"></a>00173 }
<a name="l00174"></a>00174 
<a name="l00175"></a>00175 } <span class="comment">// namespace nih</span>
</pre></div></div>
</div>
  <div id="nav-path" class="navpath">
    <ul>
      <li class="navelem"><b>bintree_gen_inline.h</b>      </li>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Variables</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>


    <li class="footer">Generated on Thu Dec 15 2011 11:56:19 for nih by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.5.1 </li>
   </ul>
 </div>


</body>
</html>
